Extensible CP-Based Autonomous Search

A main concern in Constraint Programming (CP) is to determine good variable and value order heuristics. However, this is known to be quite difficult as the effects on the solving process are rarely predictable. A novel solution to handle this concern is called Autonomous Search (AS), which is a special feature allowing an automatic reconfiguration of the solving process when a poor performance is detected. In this paper, we present a preliminary architecture for performing AS in CP. The idea is to perform an “on the fly” replacement of bad-performing heuristics by more promising ones. Another interesting feature of this architecture is its extensibility. It is possible to easily upgrade their components in order to improve the AS mechanism.